Monodromy and irreducibility of leaves

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Clique Irreducibility and Clique Vertex Irreducibility of Graphs

A graphs G is clique irreducible if every clique in G of size at least two, has an edge which does not lie in any other clique of G and is clique reducible if it is not clique irreducible. A graph G is clique vertex irreducible if every clique in G has a vertex which does not lie in any other clique of G and clique vertex reducible if it is not clique vertex irreducible. The clique vertex irred...

متن کامل

Unpredictability and Computational Irreducibility

We explore several concepts for analyzing the intuitive notion of computational irreducibility and we propose a robust formal definition, first in the field of cellular automata and then in the general field of any computable function f from N to N. We prove that, through a robust definition of what means "to be unable to compute the n th step without having to follow the same path than simulat...

متن کامل

Irreducibility of Hypersurfaces

Given a polynomial P in several variables over an algebraically closed field, we show that except in some special cases that we fully describe, if one coefficient is allowed to vary, then the polynomial is irreducible for all but at most deg(P ) − 1 values of the coefficient. We more generally handle the situation where several specified coefficients vary.

متن کامل

Irreducibility and cuspidality

Irreducible representations are the building blocks of general, semisimple Galois representations ρ, and cuspidal representations are the building blocks of automorphic forms π of the general linear group. It is expected that when an object of the former type is associated to one of the latter type, usually in terms of an identity of L-functions, the irreducibility of the former should imply th...

متن کامل

Monodromy Filtration and Positivity

We study Deligne’s conjecture on the monodromy weight filtration on the nearby cycles in the mixed characteristic case, and reduce it to the nondegeneracy of certain pairings in the semistable case. We also prove a related conjecture of Rapoport and Zink which uses only the image of the Cech restriction morphism, if Deligne’s conjecture holds for a general hyperplane section. In general we show...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Mathematics

سال: 2011

ISSN: 0003-486X

DOI: 10.4007/annals.2011.173.3.3